#include <bits/stdc++.h>
using namespace std;
long long T, n, ans, vis[100010];
struct node{
    int num, color;
}a[100010];
struct pl{
    int before, pos;
}b[100010];
bool cmp(pl x, pl y){
    if(x.before != y.before){
        return x.before > y.before;
    }
    return x.pos < y.pos;
}
int main(){
    //freopen("color.in", "r", stdin);
    //freopen("color.out", "w", stdout);
    cin >> T;
    while(T --){
        cin >> n;
        int much;
        for(int i = 1;i <= n;i ++){
            cin >> a[i].num;
            b[i].before = a[i].num;
            b[i].pos = i;
            vis[a[i].num] ++;
        }
        sort(b + 1, b + n + 1, cmp);
        while(much < n){

        }
    }
    return 0;
}
